By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 21, Issue 6, pp. 1001-1198

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Reducing the Steiner Problem in a Normed Space

D. Z. Du and F. K. Hwang

pp. 1001-1007

BibTeX  Abstract Full Text:  PDF

On the Computational Complexity of Approximating Solutions for Real Algebraic Formulae

James Renegar

pp. 1008-1025

BibTeX  Abstract Full Text:  PDF

An $O(n^2 \log n)$ Algorithm for the Hamiltonian Cycle Problem on Circular-Arc Graphs

Wei-Kuan Shih, T. C. Chern, and Wen-Lian Hsu

pp. 1026-1046

BibTeX  Abstract Full Text:  PDF

Fully Dynamic Algorithms for $2$-Edge Connectivity

Zvi Galil and Giuseppe F. Italiano

pp. 1047-1069

BibTeX  Abstract Full Text:  PDF

Work-Optimal Asynchronous Algorithms for Shared Memory Parallel Computers

Charles Martel, Arvin Park, and Ramesh Subramonian

pp. 1070-1099

BibTeX  Abstract Full Text:  PDF

Polynomial Time Productivity, Approximations, and Levelability

Jie Wang

pp. 1100-1111

BibTeX  Abstract Full Text:  PDF

Optimal Reduction of Two-Terminal Directed Acyclic Graphs

Wolfgang W. Bein, Jerzy Kamburowski, and Matthias F. M. Stallmann

pp. 1112-1129

BibTeX  Abstract Full Text:  PDF

Preemptive Ensemble Motion Planning on a Tree

Greg N. Frederickson and D. J. Guan

pp. 1130-1152

BibTeX  Abstract Full Text:  PDF

Lower Bounds on Universal Traversal Sequences for Cycles and Other Low Degree Graphs

Martin Tompa

pp. 1153-1160

BibTeX  Abstract Full Text:  PDF

Approximation and Small-Depth Frege Proofs

Stephen Bellantoni, Toniann Pitassi, and Alasdair Urquhart

pp. 1161-1179

BibTeX  Abstract Full Text:  PDF

External Internal Nodes in Digital Search Trees via Mellin Transforms

Helmut Prodinger

pp. 1180-1183

BibTeX  Abstract Full Text:  PDF

Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time

Brandon Dixon, Monika Rauch, and Robert E. Tarjan

pp. 1184-1192

BibTeX  Abstract Full Text:  PDF

Optimal Algorithms for Multiplication in Certain Finite Fields Using Elliptic Curves

Mohammad Amin Shokrollahi

pp. 1193-1198

BibTeX  Abstract Full Text:  PDF